Entrez un mot ou une phrase dans n'importe quelle langue 👆
Langue:
Traduction et analyse de mots par intelligence artificielle ChatGPT
Sur cette page, vous pouvez obtenir une analyse détaillée d'un mot ou d'une phrase, réalisée à l'aide de la meilleure technologie d'intelligence artificielle à ce jour:
- comment le mot est utilisé
- fréquence d'utilisation
- il est utilisé plus souvent dans le discours oral ou écrit
- options de traduction de mots
- exemples d'utilisation (plusieurs phrases avec traduction)
- étymologie
Qu'est-ce (qui) est N-hash - définition
N-hash
OBSOLETE CRYPTOGRAPHIC HASH FUNCTION
N-Hash
In cryptography, N-hash is a cryptographic hash function based on the FEAL round function, and is now considered insecure. It was proposed in 1990 in an article by Miyaguchi, Ohta, and Iwata; weaknesses were published the following year.
hash table
![This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.](https://commons.wikimedia.org/wiki/Special:FilePath/Hash table average insertion time.png?width=200 "This graph compares the average number of CPU cache misses required to look up elements in large hash tables (far exceeding size of the cache) with chaining and linear probing. Linear probing performs better due to better [[locality of reference]], though as the table gets full, its performance degrades drastically.")
ASSOCIATES DATA VALUES WITH KEY VALUES - A LOOKUP TABLE
Hashtable; Hash-table; Hash tables; Hash map; Rehash; Hashmap; Open hashing; Scatter storage; Address-calculation sort; Hash Table; Chaining hash table; Separate chaining; Direct chaining; Collision resolution scheme; External chaining; Load factor (computer science); Hash-Based Indexes; Hash table collisions; Hash table collision; Array hash table; Dynamic-sized hash table; Collision resolution in hash tables
one-way hash function
SPECIAL CLASS OF HASH FUNCTION THAT HAS CERTAIN PROPERTIES WHICH MAKE IT SUITABLE FOR USE IN CRYPTOGRAPHY
Message digest; Cryptographic hash; Cryptographic message digest; One-way hash; Modification Detection Code; Cryptographic hash functions; Hash function (cryptography); One-way hash function; CRHF; Secure hash function; One way encryption; Numerical hash; Cryptograhic hash; Cryptographic hash value; Cryptographic Hash Function; Cryptographic one-way hash function; Message-digest; Message-digest algorithm; Sphincter hash; Terahash; Cryptographic hashing; Wide pipe; Wide pipe hash; Wide pipe design; Wide pipe construction; Wide-pipe; Widepipe; Narrowpipe; Narrow-pipe; Narrow pipe; Applications of cryptographic hash functions; Cryptographic hashes; Hash (cryptography)
<algorithm> (Or "message digest function") A {one-way
function} which takes a variable-length message and produces a
fixed-length hash. Given the hash it is computationally
infeasible to find a message with that hash; in fact one can't
determine any usable information about a message with that
hash, not even a single bit. For some one-way hash functions
it's also computationally impossible to determine two messages
which produce the same hash.
A one-way hash function can be private or public, just like an
encryption function. MD5, SHA and Snefru are examples of
public one-way hash functions.
A public one-way hash function can be used to speed up a
public-key digital signature system. Rather than sign a
long message, which can take a long time, compute the one-way
hash of the message, and sign the hash.
{sci.crypt FAQ
(ftp://src.doc.ic.ac.uk/usenet/usenet-by-group/sci.crypt/) }.
(2001-05-10)
